Jing-fu Jenq

Reconfigurable Mesh Algorithms for the Area and Perimeter of Image Components

All Pairs Shortest Paths on a Hypercube Multiprocessor

Two plausible ways to implement Floyd’s all pairs shortest paths algorithm on a hypercube mutiprocessor are considered. These are evaluated experimentally. A comparison with using Dijkstra’s single source all desitination algorithm on each processor is also done.

Parallel Thinning on Rmesh

Thinning operation is a fundamental operation in image processing. It is a typical preprocessing stage for pattern recognition and data compression. In this report we proposed an algorithm that performs thinning operation by using reconfigurable mesh RMESH multiprocessors. The time and space complexities are both O(1) and therefore optimal.

Image Shrinking and Expanding on a Pyramid

We develop two algorithms to perform the q step shrinking and expanding of an N×N binary image on a pyramid computer with an N×N base. The time complexity of both algorithms is O(√ q ). However, one uses O(√ q ) space per processor while the per processor space requirement of the other is O (1).

On the Thread Scheduling Problem

This paper considers the thread scheduling problem. The thread scheduling problem abstracts the problem of minimizing memory latency, using a directed data dependency graph generated form a compiler, to improve run time eÆciency. Two thread scheduling problems are formulated and shown to be strongly NP-complete. New methods and algorithms for analyzing a data dependency graph in order to comput...